A configuration is reducible if no minimal 5 chromatic plane graph can contain it.
如果没有极小5色平面图能包含某个构形,就说此构形是可约的.
Clearly each plane graph has exactly one unbounded face.
显然,每个平面图都有一个无界面.
OK, and for a given value of x, what we will do is we'll slice our graph by this plane parallel to the yz plane.
对于给定的x,我们要做的就是,用平行于yz平面的平面去切图像。
We will refer to the plane of the graph as the x-y plane.
我们将把图的平面作为x -y 平面.
简答网 · 初中英语作文
简答网 · 中考英语
简答网 · 高考英语
简答网 · 职场英语
简答网 · 四六级英语